Index-compressed vector quantisation based on index mapping
نویسندگان
چکیده
منابع مشابه
Index-compressed vector quantisation based on index mapping
The authors introduce a novel coding technique which significantly improves the performance of the traditional vector quantisation (VQ) schemes at low bit rates. High interblock correlation in natural images results in a high probability that neighbouring image blocks are mapped to small subsets of the VQ codebook, which contains highly correlated codevectors. If, instead of the whole VQ codebo...
متن کاملColour image retrieval based on DCT-domain vector quantisation index histograms
A new kind of feature for colour image retrieval based on DCT-domain vector quantisation (VQ) index histograms (DCTVQIH) is proposed. For each colour image in the database, 12 histograms (four for each colour component) are calculated from 12 DCT-VQ index sequences, respectively. The retrieval simulation results show that, compared with the traditional spatial-domain colour-histogram-based feat...
متن کاملIndex Mapping for Robust Multiple Description Lattice Vector Quantizer INDEX MAPPING FOR ROBUST MULTIPLE DESCRIPTION LATTICE VECTOR QUANTIZER
Multiple Description Coding (MDC) is a source coding technique which generates several descriptions of a signal such that the reconstruction gradually refines with the number of decoded descriptions. Conventionally, the design of MDC has largely focused on combating the description loss. This thesis considers the construction of robust multiple description lattice vector quantizers (MDLVQ) by a...
متن کاملThe Compressed Overlap Index
For analysing text algorithms, for computing superstrings, or for testing random number generators, one needs to compute all overlaps between any pairs of words in a given set. The positions of overlaps of a word onto itself, or of two words, are needed to compute the absence probability of a word in a random text, or the numbers of common words shared by two random texts. In all these contexts...
متن کاملThe FM-Index: A Compressed Full-Text Index Based on the BWT
In this talk we address the issue of indexing compressed data both from the theoretical and the practical point of view. We start by introducing the FM-index data structure [2] that supports substring searches and occupies a space which is a function of the entropy of the indexed data. The key feature of the FM-index is that it encapsulates the indexed data (self-index) and achieves the space r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEE Proceedings - Vision, Image, and Signal Processing
سال: 1997
ISSN: 1350-245X
DOI: 10.1049/ip-vis:19970984